|
Gábor N. Sárközy (Gabor Sarkozy) is a Hungarian-American mathematician, the son of noted mathematician András Sárközy. He is currently on faculty of the Computer Science Department at Worcester Polytechnic Institute, MA, United States and is also a senior research fellow at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.〔(Gabor Sarkozy's Renyi Homepage )〕 He obtained a Diploma in Mathematics from Eötvös Loránd University and a PhD in Computer Science from Rutgers, under the advisement of Endre Szemerédi.〔(The Mathematics Genealogy Project for Endre Szemeredi )〕 Perhaps his best known result is the Blow-Up Lemma,〔J. Komlós, G. N. Sárközy, E. Szemerédi: Blow-up Lemma, "Combinatorica", 17 (1), 1997, pp. 109-123〕〔J. Komlós, G. N. Sárközy, E. Szemerédi: An algorithmic version of the Blow-up Lemma, "Random Structures and Algorithms", 12, 1998, pp. 297-312〕 in which, together with János Komlós and Endre Szemerédi he proved that the regular pairs in Szemerédi regularity lemma behave like complete bipartite graphs under the correct conditions. The lemma allowed for deeper exploration into the nature of embeddings of large sparse graphs into dense graphs. A hypergraph variant was developed later by Peter Keevash. He is member of the editorial board of the ''European Journal of Combinatorics''.〔(Editorial Board ), European Journal of Combinatorics, Elsevier. Accessed March 31, 2012〕 He also has an Erdős number of 1.〔(On Cycles in the Coprime Graph of Integers )〕 ==References== 〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Gábor N. Sárközy」の詳細全文を読む スポンサード リンク
|